In defense of de ® nitions
نویسندگان
چکیده
The arguments of Fodor, Garret, Walker and Parkes [(1980) Against de® nitions, Cognition, 8, 263± 367] are the source of widespread skepticism in cognitive science about lexical semantic structure. Whereas the thesis that lexical items, and the concepts they express, have decompositional structure (i.e. have signi® cant constituents) was at one time a one of those ideas that hardly anybody [in the cognitive sciences] ever considers giving upo (p. 264), most researchers now believe that a [a]ll the evidence suggests that the classical [(decompositional)] view is wrong as a general theory of conceptso [Smith, Medin & Rips (1984) A psychological approach to concepts: comments on Rey, Cognition, 17, 272], and cite Fodor et al. (1980) as a sounding the death knell for decompositional theorieso [MacNamara & Miller (1989) Attributes of theories of meaning, Psychological Bulletin, 106, 360]. I argue that the prevailing skepticism is unmotivated by the arguments in Fodor et al. Fodor et al. misrepresent the form, function and scope of the decompositional hypothesis, and the procedures they employ to test for the psychological reality of de® nitions are ̄ awed. I argue, further, that decompositional explanations of the phenomena they consider are preferable to their primitivist alternatives, and, hence, that there is prima facie reason to accept them as evidence for the existence of decompositional structure. Cognitive scientists would, therefore, do well to revert to their former commitment to the decompositional hypothesis.
منابع مشابه
Mining distributed databases for attribute definitions
The paper focuses on discovery of knowledge needed to establish the shared meaning of attributes in a network of distributed autonomous databases. In this paper we concentrate on the role of equations as de nitions of attribute values. We brie y describe various applications of such de nitions, including predictions, knowledge veri cation, intelligent query answering and several others. We pres...
متن کاملRe ning de nitions with unknown opens using XSB for IDP
FO(·) is a declarative modeling language that extends rst-order logic with inductive de nitions, partial functions, types and aggregates. Its model generator IDP grounds the problem into a lowlevel (propositional) representation and consequently use a generic solver to search for a solution. Recent work introduced a technique that evaluates all de nitions that depend on fully known information ...
متن کاملFirst - Order De nitions of Functions
First-order learning involves nding a clause-form de nition of a relation from examples of the relation and relevant background information. In this paper, a particular rst-order learning system is modi ed to customize it for nding de nitions of functional relations. This restriction leads to faster learning times and, in some cases, to de nitions that have higher predictive accuracy. Other rst...
متن کاملDesignated Con rmer Signatures Revisited
Previous de nitions of designated con rmer signatures in the literature are incomplete, and the proposed security de nitions fail to capture key security properties, such as unforgeability against malicious con rmers and non-transferability. We propose new de nitions. Previous schemes rely on the random oracle model or set-up assumptions, or are secure with respect to relaxed security de nition...
متن کاملGeneralized Implicit De nitions on Finite Structures
We propose a natural generalization of the concept of im plicit de nitions over nite structures allowing non determinism at an intermediate level of a deterministic de nition These generalized im plicit de nitions o er more expressive power than classical implicit de nitions Moreover their expressive power can be characterized over un ordered nite structures in terms of the complexity class NP ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001